Splitting a graph into disjoint induced paths or cycles
نویسندگان
چکیده
منابع مشابه
Splitting a graph into disjoint induced paths or cycles
A graph is an X-graph of Y-graphs (or two-level clustered graph) if its vertices can be partitioned into subsets (called clusters) such that each cluster induces a graph belonging to the given class Y and the graph of the clusters belongs to another given class X. Two-level clustered graphs are a useful and interesting concept in graph drawing. We consider the complexity of recognizing two-leve...
متن کاملKernel Bounds for Disjoint Cycles and Disjoint Paths
In this paper, we give evidence for the problems Disjoint Cycles and Disjoint Paths that they cannot be preprocessed in polynomial time such that resulting instances always have a size bounded by a polynomial in a specified parameter (or, in short: do not have a polynomial kernel); these results are assuming the validity of certain complexity theoretic assumptions. We build upon recent results ...
متن کاملDisjoint 5-cycles in a graph
We prove that if G is a graph of order 5k and the minimum degree of G is at least 3k then G contains k disjoint cycles of length 5.
متن کاملDisjoint long cycles in a graph
We prove that if G is a graph of order at least 2k with k 9 and the minimum degree of G is at least k + 1, then G contains two vertex-disjoint cycles of order at least k. Moreover, the condition on the minimum degree is sharp.
متن کاملVertex disjoint cycles in a directed graph
Let D be a directed graph of order n 4 and minimum degree at least (3n 3)/2. Let n = nI + n2 where nl 2 and n2 2. Then D contains two vertex-disjoint directed cycles of nI and n2 respectively. The result is sharp if n ~ 6: we give counterexamples if the condition on the minimum degree is relaxed. 1 Introduction We discuss only finite simple graphs and strict and use standard terminology and not...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2003
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(02)00425-0